Geometric convergence of the Metropolis-Hastings simulation algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Geometric Interpretation of the Metropolis–Hastings Algorithm

The Metropolis-Hastings algorithm transforms a given stochastic matrix into a reversible stochastic matrix with a prescribed stationary distribution. We show that this transformation gives the minimum distance solution in an L1 metric.

متن کامل

Geometric Convergence of the Metropolis Hastings Simulation Algorithm Lars Holden Norwegian Computing Center and University of Oslo

Necessary and su cient conditions for geometric con vergence in the relative supremum norm of the Metropolis Hastings simulation algorithm with a general generating function are estab lished An explicit expression for the convergence rate is given Introduction This paper discusses the convergence rate for the Metropolis Hastings simulation algorithm proposed in Hastings The Metropolis Hastings ...

متن کامل

The Metropolis-Hastings-Green Algorithm

1.1 Dimension Changing The Metropolis-Hastings-Green algorithm (as opposed to just MetropolisHastings with no Green) is useful for simulating probability distributions that are a mixture of distributions having supports of different dimension. An early example (predating Green’s general formulation) was an MCMC algorithm for simulating spatial point processes (Geyer and Møller, 1994). More wide...

متن کامل

Understanding the Metropolis-Hastings Algorithm

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

Convergence of Conditional Metropolis-Hastings Samplers

We consider Markov chain Monte Carlo algorithms which combine Gibbs updates with Metropolis-Hastings updates, resulting in a conditional Metropolis-Hastings sampler (CMH). We develop conditions under which the CMH will be geometrically or uniformly ergodic. We illustrate our results by analysing a CMH used for drawing Bayesian inferences about the entire sample path of a diffusion process, base...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics & Probability Letters

سال: 1998

ISSN: 0167-7152

DOI: 10.1016/s0167-7152(98)00096-0